Preprocessing the MAP Problem
نویسندگان
چکیده
The MAP problem for Bayesian networks is the problem of finding for a set of variables an instantiation of highest posterior probability given the available evidence. The problem is known to be computationally infeasible in general. In this paper, we present a method for preprocessing the MAP problem with the aim of reducing the runtime requirements for its solution. Our method exploits the concepts of Markov and MAP blanket for deriving partial information about a solution to the problem. We investigate the practicability of our preprocessing method in combination with an exact algorithm for solving the MAP problem for some real Bayesian networks.
منابع مشابه
Enhancing Learning from Imbalanced Classes via Data Preprocessing: A Data-Driven Application in Metabolomics Data Mining
This paper presents a data mining application in metabolomics. It aims at building an enhanced machine learning classifier that can be used for diagnosing cachexia syndrome and identifying its involved biomarkers. To achieve this goal, a data-driven analysis is carried out using a public dataset consisting of 1H-NMR metabolite profile. This dataset suffers from the problem of imbalanced classes...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملView-invariant Regions and Mobile Robot
| This paper addresses the problem of mobile robot self-localization given a polygonal map and a set of observed edge segments. The standard approach uses interpretation tree search with pruning heuristics to match observed edges to map edges. Our approach introduces a preprocessing step in which the map is decomposed into view-invariant regions (VIRs). The VIR decomposition captures informatio...
متن کاملThe Robot Localization Problem
We consider the following problem: given a simple polygon P and a star-shaped polygon V, nd a point (or the set of points) in P from which the portion of P that is visible is translation-congruent to V. The problem arises in the localization of robots equipped with a range-nder and a compass | P is a map of a known environment, V is the portion visible from the robot's position, and the robot m...
متن کاملThe Metro Map Layout Problem
Abstract. We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing step. The experimental results wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006